Knowledge graph embedding for experimental uncertainty estimation

نویسندگان

چکیده

Purpose Experiments are the backbone of development process data-driven predictive models for scientific applications. The quality experiments directly impacts model performance. Uncertainty inherently affects experiment measurements and is often missing in available data sets due to its estimation cost. For similar reasons, very few compared other sources. Discarding based on uncertainty values would preclude models. Data profiling techniques fundamental assess quality, but some dimensions challenging evaluate without knowing uncertainty. In this context, paper aims predict experiments. Design/methodology/approach This work presents a methodology forecast experiments’ uncertainty, given set ontological description. approach knowledge graph embeddings leverages task link prediction over representation database. validity first tested multiple conditions using synthetic then applied large chemical kinetic domain as case study. Findings analysis results different test scenarios suggest that embedding can be used when there hidden relationship between metadata values. also resilient random noise relationship. outperforms baseline if depends upon metadata. Originality/value employment experimental novel alternative current more costly literature. Such contribution permits better repositories improves

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantically Smooth Knowledge Graph Embedding

This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...

متن کامل

ProjE: Embedding Projection for Knowledge Graph Completion

With the large volume of new information created every day, determining the validity of information in a knowledge graph and filling in its missing parts are crucial tasks for many researchers and practitioners. To address this challenge, a number of knowledge graph completion methods have been developed using low-dimensional graph embeddings. Although researchers continue to improve these mode...

متن کامل

Locally Adaptive Translation for Knowledge Graph Embedding

Knowledge graph embedding aims to represent entities and relations in a large-scale knowledge graph as elements in a continuous vector space. Existing methods, e.g., TransE and TransH, learn embedding representation by defining a global margin-based loss function over the data. However, the optimal loss function is determined during experiments whose parameters are examined among a closed set o...

متن کامل

Context-Dependent Knowledge Graph Embedding

We consider the problem of embedding knowledge graphs (KGs) into continuous vector spaces. Existing methods can only deal with explicit relationships within each triple, i.e., local connectivity patterns, but cannot handle implicit relationships across different triples, i.e., contextual connectivity patterns. This paper proposes context-dependent KG embedding, a twostage scheme that takes into...

متن کامل

GAKE: Graph Aware Knowledge Embedding

Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware know...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information discovery and delivery

سال: 2023

ISSN: ['2398-6255', '2398-6247']

DOI: https://doi.org/10.1108/idd-06-2022-0060